Finite fields - PDFSEARCH.IO - Document Search Engine

Finite fields
Results: 995

#	Item
451	Constructing Abelian Varieties for Pairing-Based Cryptography Constructing Abelian Varieties for Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2009-05-04 09:49:01 Abelian varieties Algebraic curves Cryptography Finite fields Hasse–Witt matrix Weil pairing Supersingular elliptic curve Tate pairing Complex multiplication Abstract algebra Algebra Elliptic curves
452	High-Speed CRC Computation Add to Reading List Source URL: tracebase.nmsu.edu Language: English - Date: 2010-11-24 18:34:45 Mathematics Computation of CRC Printf format string Computing Polynomial code Computer programming Mathematics of CRC Finite fields Binary arithmetic Cyclic redundancy check
453	Understanding and Using Cyclic Redundancy Checks with Maxim 1-Wire and iButton Products - Application Note - Maxim Add to Reading List Source URL: pdfserv.maximintegrated.com Language: English - Date: 2013-10-09 15:18:55 Cyclic redundancy check Mathematics Information Numbers 1-Wire Parity bit Network packet Computation of CRC CRC-based framing Binary arithmetic Finite fields Data transmission
454	Pairing-Based Identification Schemes Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2008-06-06 19:27:43 Public-key cryptography Finite fields BLS Computational Diffie–Hellman assumption Diffie–Hellman problem Decisional Diffie–Hellman assumption Diffie–Hellman key exchange Zero-knowledge proof Digital signature Cryptography Computational hardness assumptions Cryptographic protocols
455	Memory-saving computation of the pairing final exponentiation on BN curves∗ Sylvain Duquesne and Loubna Ghammam March 3, 2015 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-03-03 08:06:21 Finite fields Computer arithmetic Exponentiation by squaring XTR Exponentiation Elliptic curves Abstract algebra Exponentials Mathematics
456	Draft CYCLIC REDUNDANCY CHECKS IN USB Introduction The USB specification calls for the use of Cyclic Redundancy Checksums (CRC) to protect all non-PID fields in token and data packets from errors during transmission. Th Add to Reading List Source URL: www.usb.org Language: English - Date: 2005-04-14 12:54:13 Computing Data Cyclic redundancy check Universal Serial Bus Network packet Polynomial code Communications protocol Modulo operation Transmission Control Protocol Finite fields Information Binary arithmetic
457	Constructing Abelian Varieties for Pairing-Based Cryptography by David Stephen Freeman A.B. (Harvard University) 2002 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2008-06-06 19:27:52 Elliptic curves Abelian varieties Cryptography Finite fields Complex multiplication Supersingular elliptic curve Pairing Abelian surface Frobenius endomorphism Abstract algebra Algebra Algebraic surfaces
458	David Mandell Freeman (+[removed]Curriculum Vitae [removed] Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2012-06-11 19:59:59 Elliptic curve cryptography Algorithmic Number Theory Symposium Dan Boneh International Association for Cryptologic Research Pairing Lecture Notes in Computer Science International Cryptology Conference Elliptic curve PKC Cryptography Abstract algebra Finite fields
459	Fast arithmetic and pairing evaluation on genus 2 curves David Freeman University of California, Berkeley [removed] November 6, 2005 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2008-06-06 19:27:47 Group theory Polynomial Euclidean algorithm Finite fields Elliptic curves Integer factorization algorithms Lenstra elliptic curve factorization Factorization of polynomials over a finite field and irreducibility tests Abstract algebra Mathematics Algebra

UPDATE